Solving nesting problems with non-convex polygons by constraint logic programming
نویسندگان
چکیده
منابع مشابه
Solving Nesting Problems with Non-Convex Polygons by Constraint Logic Programming
In this paper an application of constraint logic programming (CLP) to the resolution of nesting problems is presented. Nesting problems are a special case of the cutting and packing problems, in which the pieces generally have non-convex shapes. Due to their combinatorial optimization nature, nesting problems have traditionally been tackled by heuristics and in the recent past by meta-heuristic...
متن کاملApplying Constraint Logic Programming to the Resolution of Nesting Problems
Nesting problems are combinatorial optimisation problems where one or more pieces of material or space must be divided into smaller irregular pieces, minimising the waste. In OR, the state-of-the-art in nesting problems is to solve them by means of heuristic algorithms; the use of mixed integer programming models can handle only rather small instances. The satisfaction of geometric constraints ...
متن کاملASP-DPOP: solving distributed constraint optimization problems with logic programming
Researchers have used Distributed Constraint Optimization Problems (DCOPs) to model various multi-agent coordination and resource allocation problems. However, existing DCOP algorithms have focused almost exclusively on imperative programming techniques. This paper explores a new direction, which is to develop algorithms that use declarative programming, specifically logic programming, techniques.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملSolving Distributed Constraint Optimization Problems Using Logic Programming
This paper explores the use of answer set programming (ASP) in solving distributed constraint optimization problems (DCOPs). It makes the following contributions: (i) It shows how one can formulate DCOPs as logic programs; (ii) It introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (iii) It experimentally shows that ASP-DPOP can be up to two orders of magnitude fas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2003
ISSN: 0969-6016,1475-3995
DOI: 10.1111/1475-3995.00434